K-forested Choosability of Graphs with Bounded Maximum Average Degree
نویسندگان
چکیده
A proper vertex coloring of a simple graph is k-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than k. A graph is k-forested qchoosable if for a given list of q colors associated with each vertex v, there exists a k-forested coloring of G such that each vertex receives a color from its own list. In this paper, we prove that the k-forested choosability of a graph with maximum degree ∆ ≥ k ≥ 4 is at most
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملAcyclic improper choosability of graphs
We consider improper colorings (sometimes called generalized, defective or relaxed colorings) in which every color class has a bounded degree. We propose a natural extension of improper colorings: acyclic improper choosability. We prove that subcubic graphs are acyclically (3,1)∗-choosable (i.e. they are acyclically 3-choosable with color classes of maximum degree one). Using a linear time algo...
متن کاملImproper choosability of graphs and maximum average degree
Improper choosability of planar graphs has been widely studied. In particular, Škrekovski investigated the smallest integer gk such that every planar graph of girth at least gk is k-improper 2-choosable. He proved [9] that 6 ≤ g1 ≤ 9; 5 ≤ g2 ≤ 7; 5 ≤ g3 ≤ 6 and ∀k ≥ 4, gk = 5. In this paper, we study the greatest real M(k, l) such that every graph of maximum average degree less than M(k, l) is ...
متن کاملLinear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree
A proper vertex colouring of a graph G is 2-frugal (resp. linear) if the graph induced by the vertices of any two colour classes is of maximum degree 2 (resp. is a forest of paths). A graph G is 2-frugally (resp. linearly) L-colourable if for a given list assignment L : V (G) → 2, there exists a 2-frugal (resp. linear) colouring c of G such that c(v) ∈ L(v) for all v ∈ V (G). If G is 2-frugally...
متن کاملLinear choosability of graphs
A proper vertex coloring of a non oriented graph G = (V, E) is linear if the graph induced by the vertices of two color classes is a forest of paths. A graph G is L-list colorable if for a given list assignment L = {L(v) : v ∈ V }, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V . If G is L-list colorable for every list assignment with |L(v)| ≥ k for all v ∈ V , then G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1102.3987 شماره
صفحات -
تاریخ انتشار 2011